Sifting

Linear Sifting of Decision

Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

Lower Bound Sifting for MDDs

Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; t...

Linear Sifting of Decision Diagrams yChristoph

We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...

A Model Sifting Problem of Selberg

We study a model sifting problem introduced by Selberg, in which all of the primes have roughly the same size. We show that the Selberg lower bound sieve is asymptotically optimal in this setting, and we use this to give a new lower bound on the sifting limit βκ in terms of the sifting dimension κ. We also show that one can use a rounding procedure to improve on the Selberg lower bound sieve by...

HHT Sifting and Adaptive Filtering